#define _CRT_SECURE_NO_WARNINGS 1

// 1
/*
#include <iostream>
#include <string>
using namespace std;

int main()
{
	string nums; cin >> nums;
	int count = 0;
	for (int i = nums.size()-1; i >= 0; i--) {
		count++;
		if (count == 3) {
			count = 0;
			nums.insert(nums.begin() + i, ',');
			//i++;
		}
	}
	if (nums[0] == ',') nums.erase(nums.begin());
	cout << nums << endl;
	return 0;
}
*/

// 2
/*
#include <iostream>
#include <vector>
using namespace std;

int main()
{
	int n; cin >> n;
	vector<int> dp(n + 2, 0);
	dp[0] = 1; dp[1] = 1;
	for (int step = 2; step <= n; step++)
	{
		dp[step] = dp[step - 1] + dp[step - 2];
	}
	cout << dp[n] << endl;
	return 0;
}
*/

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

class Solution {
public:
	
	bool IsContinuous(vector<int>& cards) {
		int joker = 0;
		int need = 0;
		sort(cards.begin(), cards.end());
		for (int i = 0; i < 4; i++) {
			if (cards[i] == 0)	joker++;
			else if (cards[i] == cards[i + 1])	return false;
			else
				need += (cards[i + 1] - cards[i] - 1);
		}
		return need == joker || need == 0;
	}
};

int main()
{
	
	return 0;
}